On generalised convex mathematical programming

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalised multisets for chemical programming

Gamma is a programming model where computation can be seen as chemical reactions between data represented as molecules floating in a chemical solution. This model can be formalized as associative, commutative, conditional rewritings of multisets where rewrite rules and multisets represent chemical reactions and solutions, respectively. In this article, we generalize the notion of multiset used ...

متن کامل

On calmness conditions in convex bilevel programming

In this article, we compare two different calmness conditions which are widely used in the literature on bilevel programming and on mathematical programs with equilibrium constraints. In order to do so, we consider convex bilevel programming as a kind of intersection between both research areas. The so-called partial calmness concept is based on the function value approach for describing the lo...

متن کامل

On Convex Programming Relaxations for the Permanent

In recent years, several convex programming relaxations have been proposed to estimate the permanent of a non-negative matrix, notably in the works of [GS02, Gur11, GS14]. However, the origins of these relaxations and their relationships to each other have remained somewhat mysterious. We present a conceptual framework, implicit in the belief propagation literature, to systematically arrive at ...

متن کامل

On Verified Numerical Computations in Convex Programming

This survey contains recent developments for computing verified results of convex constrained optimization problems, with emphasis on applications. Especially, we consider the computation of verified error bounds for non-smooth convex conic optimization in the framework of functional analysis, for linear programming, and for semidefinite programming. A discussion of important problem transforma...

متن کامل

On Convex Probabilistic Programming with Discrete Distributions

We consider convex stochastic programming problems with probabilistic constraints involving integer valued random variables The concept of a p e cient point of a probability distribution is used to derive various equivalent problem for mulations Next we introduce the concept of r concave discrete probability distri butions and analyse its relevance for problems under consideration These notions...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics

سال: 1992

ISSN: 0334-2700,1839-4078

DOI: 10.1017/s0334270000007372